A Functional Central Limit Theorem for a Markov-Modulated Infinite-Server Queue
نویسندگان
چکیده
منابع مشابه
A Central Limit Theorem for Markov-Modulated Infinite-Server Queues
This paper studies an infinite-server queue in a Markov environment, that is, an infinite-server queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N and the rate qij of the background process by a factor N, with α ∈ R, we establish a central limit theorem as N tends to ∞. We find different scaling regime...
متن کاملFunctional central limit theorems for Markov-modulated infinite-server systems
In this paper we study the Markov-modulated M/M/∞ queue, with a focus on the correlation structure of the number of jobs in the system. The main results describe the system’s asymptotic behavior under a particular scaling of the model parameters in terms of a functional central limit theorem. More specifically, relying on the martingale central limit theorem, this result is established, coverin...
متن کاملTail asymptotics of a Markov-modulated infinite-server queue
This paper analyzes large deviation probabilities related to the number of customers in a Markov modulated infinite-server queue, with state-dependent arrival and service rates. Two specific scalings are studied: in the first, just the arrival rates are linearly scaled by N (for large N ), whereas in the second in addition the Markovian background process is sped up by a factor N , for some > 0...
متن کاملAnalysis of Markov-modulated Infinite-server Queues in the Central-limit Regime
This paper focuses on an infinite-server queue modulated by an independently evolving finite-state Markovian background process, with transition rate matrix Q ≡ (qij)i,j=1. Both arrival rates and service rates are depending on the state of the background process. The main contribution concerns the derivation of central limit theorems for the number of customers in the system at time t ≥ 0, in t...
متن کاملA Single-Server Queue with Markov Modulated Service Times
We study a queueing system with a Poisson arrival process and Markov modulated, exponential service requirements. For a modulating Markov Chain with two states, we show that the distribution of the number-in-system is a superposition of two matrix-geometric series and provide a simple algorithm for computing the rate and coefficient matrices. These results hold for both finite and infinite wait...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methodology and Computing in Applied Probability
سال: 2014
ISSN: 1387-5841,1573-7713
DOI: 10.1007/s11009-014-9405-8